On an Open Problem of F. Qi
نویسندگان
چکیده
In the paper Several integral inequalities published in J. Inequal. Pure Appl. Math. 1 (2000), no. 2, Art. 19 (http://jipam.vu.edu.au/v1n2.html.001_00.html) and RGMIA Res. Rep. Coll. 2(7) (1999), Art. 9, 1039–1042 (http://rgmia.vu.edu.au/ v2n7.html) by F. Qi, an open problem was posed. In this article we give the solution and further generalizations of this problem. Reverse inequalities to the posed one are considered and, finally, the derived results are extended to weighted integral inequalities.
منابع مشابه
A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملOn an Open Problem of Integral Inequalities
In this paper, some generalized integral inequalities which originate from an open problem posed in [F. Qi, Several integral inequalities, J. Inequal. Pure Appl. Math., 1(2) (2000), Art. 19] are established.
متن کاملAn imperialist competitive algorithm for solving the production scheduling problem in open pit mine
Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...
متن کاملMinimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times
We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...
متن کاملComplete Monotonicity of Logarithmic Mean
In the article, the logarithmic mean is proved to be completely monotonic and an open problem about the logarithmically complete monotonicity of the extended mean values is posed.
متن کامل